Evidence Directed Generation of Plausible Crime Scenarios with Identity Resolution.

Disclosing false identity through hybrid link analysis.

A Distance Measure Approach to Exploring the Rough Set Boundary Region for Attribute Reduction.

Risk assessment of serious crime with fuzzy random theory.

Fuzzy%2Drough approaches for mammographic risk analysis.

Intelligent hybrid approach to false identity detection.

Intelligent Systems for Decision Support.
In this paper, we introduce the ROADMAP meta-model, designed to  describe intelligent adaptive systems in open environments, using agent concepts  such as roles. Developing intelligent adaptive systems creates new challenges  in engineering software quality attributes such as correctness and reliability.
Effective Feature Selection for Mars McMurdo Terrain Image Classification.

Taking Fuzzy%2DRough Application to Mars.

Fuzzy Sets and Rough Sets for Scenario Modelling and Analysis.

Improving throughput by tuning carrier sensing in 802.11 wireless networks.

Power controlled network protocols for Multi%2DRate ad hoc networks.

Feature selection for aiding glass forensic evidence analysis.

Learning Bayesian Network Equivalence Classes with Ant Colony Optimization.
Bayesian networks are a useful tool in the representation of uncertain knowledge. This paper proposes a new algorithm called ACO-E, to learn the structure of a Bayesian network. It does this by conducting a search through the space of equivalence classes of Bayesian networks using Ant Colony Optimization (ACO). To this end, two novel extensions of traditional ACO techniques are proposed and implemented. Firstly, multiple types of moves are allowed. Secondly, moves can be given in terms of indices that are not based on construction graph nodes. The results of testing show that ACO-E performs better than a greedy search and other state-of-the-art and metaheuristic algorithms whilst searching in the space of equivalence classes. 1.
Exploring the boundary region of tolerance rough sets for feature selection.

Linguistic probabilities theory and application.

Random fuzzy alternating renewal processes.

Linguistic probabilities theory and application.



Admission Control for Providing QoS in Wireless Mesh Networks.

Approximation%2Dbased feature selection and application for algae population estimation.
This paper presents a data-driven approach for feature selection to address the common problem of dealing with high-dimensional data. This approach is able to handle the real-valued nature of the domain features, unlike many existing approaches. This is accomplished through the use of fuzzy-rough approximations. The paper demonstrates the effectiveness of this research by proposing an estimator of algae populations, a system that approximates, given certain water characteristics, the size of algae populations. This estimator significantly reduces computer time and space requirements, decreases the cost of obtaining measurements and increases runtime efficiency, making itself more viable economically. By retaining only information required for the estimation task, the system offers higher accuracy than conventional estimators. Finally, the system does not alter the domain semantics, making any distilled knowledge human-readable. The paper describes the problem domain, architecture and operation of the system, and provides and discusses detailed experimentation. The results show that algae estimators using a fuzzy-rough feature selection step produce more accurate predictions of algae populations in general. Keywords Feature evaluation and selection; Data-driven knowledge acquisition; Classification; Fuzzy-rough sets; Algae population estimation. 1
Fuzzy Interpolation and Extrapolation A Practical Approach.

Modeling Random Fuzzy Renewal Reward Processes.

Fuzzy diagnosis of turbomachines.

Reinforcing fuzzy rule%2Dbased diagnosis of turbomachines with case%2Dbased reasoning.

Distance Measure Assisted Rough Set Feature Selection.

Tolerance%2Dbased and Fuzzy%2DRough Feature Selection.

Towards Fuzzy Compositional Modelling.

The evaluation of evidence for exponentially distributed data.

Fuzzy%2DRough Sets Assisted Attribute Selection.

Rough Feature Selection for Intelligent Classifiers.

Speeding up the learning of equivalence classes of bayesian network structures.
Bayesian networks have become a standard technique in the representation of uncertain knowledge. This paper proposes methods that can accelerate the learning of a Bayesian network structure from a data set. These methods are applicable when learning an equivalence class of Bayesian network structures whilst using a score and search strategy. They work by constraining the number of validity tests that need to be done and by caching the results of validity tests. The results of experiments show that the methods improve the performance of algorithms that search through the space of equivalence classes multiple times and that operate on wide data sets. The experiments were performed by sampling data from six standard Bayesian networks and running an ant colony optimization algorithm designed to learn a Bayesian network equivalence class. 1
Webpage Classification with ACO%2DEnhanced Fuzzy%2DRough Feature Selection.

Simultaneous Ant Colony Optimization Algorithms for Learning Linguistic Fuzzy Rules.

Granularity and disaggregation in compositional modelling with applications to ecological systems.

Data%2Ddriven fuzzy rule generation and its application for student academic performance evaluation.
Several approaches using fuzzy techniques have been proposed to provide a practical method for evaluating student academic performance. However, these approaches are largely based on expert opinions and are difficult to explore and utilize valuable information embedded in collected data. This paper proposes a new method for evaluating student academic performance based on data-driven fuzzy rule induction. A suitable fuzzy inference mechanism and associated Rule Induction Algorithm is given. The new method has been applied to perform Criterion-Referenced Evaluation (CRE) and comparisons are made with typical existing methods, revealing significant advantages of the present work. The new method has also been applied to perform Norm-Referenced Evaluation (NRE), demonstrating its potential as an extended method of evaluation that can produce new and informative scores based on information gathered from data.
Fuzzy Interpolative Reasoning via Scale and Move Transformations.
Fuzzy interpolation reasoning via scale
Probabilistic Abductive Computation of Evidence Collection Strategies in Crime Investigation.

Finding Rough Set Reducts with SAT.
Abstract. Feature selection refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine learning, pattern recognition and signal processing. In particular, solution to this has found successful application in tasks that involve datasets containing huge numbers of features (in the order of tens of thousands), which would be impossible to process further. Recent examples include text processing and web content classification. Rough set theory has been used as such a dataset pre-processor with much success, but current methods are inadequate at finding minimal reductions, the smallest sets of features possible. This paper proposes a technique that considers this problem from a propositional satisfiability perspective. In this framework, minimal subsets can be located and verified. An initial experimental investigation is conducted, comparing the new method with a standard rough set-based feature selector. 1
Fuzzy%2Drough data reduction with ant colony optimization.
Feature selection refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine learning, pattern recognition and signal processing. In particular, solution to this has found successful application in tasks that involve datasets containing huge numbers of features (in the order of tens of thousands), which would be impossible to process further. Recent examples include text processing and web content classification. Rough set theory has been used as such a dataset pre-processor with much success, but current methods are inadequate at finding minimal reductions, the smallest sets of features possible. To alleviate this difficulty, a feature selection technique that employs a hybrid variant of rough sets, fuzzy-rough sets, has been developed recently and has been shown to be effective. However, this method is still not able to find the optimal subsets regularly. This paper proposes a new feature selection mechanism based on Ant Colony Optimization in an attempt to combat this. The method is then applied to the problem of finding optimal feature subsets in the fuzzy-rough data reduction process. The present work is applied to complex systems monitoring and experimentally compared with the original fuzzy-rough method, an entropy-based feature selector, and a transformation-based reduction method, PCA. Comparisons with the use of a support vector classifier are also included.
Exhibiting the behavior of time%2Ddelayed systems via an extension to qualitative simulation.

Fuzzy%2Drough attribute reduction with application to web categorization.

Fault identification through the combination of symbolic conflict recognition and Markov chain%2Daided belief revision.

Semantics%2DPreserving Dimensionality Reduction Rough and Fuzzy%2DRough%2DBased Approaches.
Abstract—Semantics-preserving dimensionality reduction refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine learning, pattern recognition, and signal processing. This has found successful application in tasks that involve data sets containing huge numbers of features (in the order of tens of thousands), which would be impossible to process further. Recent examples include text processing and Web content classification. One of the many successful applications of rough set theory has been to this feature selection area. This paper reviews those techniques that preserve the underlying semantics of the data, using crisp and fuzzy rough set-based methodologies. Several approaches to feature selection based on rough set theory are experimentally compared. Additionally, a new area in feature selection, feature grouping, is highlighted and a rough set-based feature grouping technique is detailed. Index Terms—Dimensionality reduction, feature selection, feature transformation, rough selection, fuzzy-rough selection. 1
Fault identification through the combination of symbolic conflict recognition and Markov chain%2Daided belief revision.

Compositional Model Repositories via Dynamic Constraint Satisfaction with Order%2Dof%2DMagnitude Preferences.
The predominant knowledge-based approach to automated model construction, compositional  modelling, employs a set of models of particular functional components. Its inference mechanism  takes a scenario describing the constituent interacting components of a system and translates it into  a useful mathematical model. This paper presents a novel compositional modelling approach aimed  at building model repositories. It furthers the field in two respects. Firstly, it expands the application  domain of compositional modelling to systems that can not be easily described in terms of  interacting functional components, such as ecological systems. Secondly, it enables the incorporation  of user preferences into the model selection process. These features are achieved by casting the  compositional modelling problem as an activity-based dynamic preference constraint satisfaction  problem, where the dynamic constraints describe the restrictions imposed over the composition of  partial models and the preferences correspond to those of the user of the automated modeller. In  addition, the preference levels are represented through the use of symbolic values that differ in  orders of magnitude.
Selecting informative features with fuzzy%2Drough sets and its application for complex systems monitoring.
One of the main obstacles facing current intelligent pattern recognition appli-cations is that of dataset dimensionality. To enable these systems to be effective, a redundancy-removing step is usually carried out beforehand. Rough Set Theory (RST) has been used as such a dataset pre-processor with much success, however it is reliant upon a crisp dataset; important information may be lost as a result of quantization of the underlying numerical features. This paper proposes a feature selection technique that employs a hybrid variant of rough sets, fuzzy-rough sets, to avoid this information loss. The current work retains dataset semantics, allowing for the creation of clear, readable fuzzy models. Experimental results, of applying the present work to complex systems monitoring, show that fuzzy-rough selection is more powerful than conventional entropy-based, PCA-based and random-based methods. Key words: feature selection; feature dependency; fuzzy-rough sets; reduct search; rule induction; systems monitoring. 1
Linguistic Bayesian Networks for Reasoning will Objective Probabilities in Forensic Statistics.

Semantics%2DPreserving Dimensionality Reduction in Intelligent Modelling.

Using Fuzzy Dependency%2DGuided Attribute Grouping in Feature Selection.
Abstract. Feature selection has become a vital step in many machine learning techniques due to their inability to handle high dimensional descriptions of input features. This paper demonstrates the applicability of fuzzy-rough attribute reduction and fuzzy dependencies to the problem of learning classifiers, resulting in simpler rules with little loss in classification accuracy. 1
Fuzzy rrDFCSP and planning.
Constraint satisfaction is a fundamental Artificial Intelligence technique for knowledge representation and inference. However, the formulation of a static constraint satisfaction problem (CSP) with hard, imperative constraints is insufficient to model many real problems. Fuzzy constraint satisfaction provides a more graded viewpoint. Priorities and preferences are placed on individual constraints and aggregated via fuzzy conjunction to obtain a satisfaction degree for a solution to the problem. This paper examines methods for solving an important instance of dynamic flexible constraint satisfaction (DFCSP) combining fuzzy CSP and restriction/relaxation based dynamic CSP: fuzzy rrDFCSP. This allows the modelling of complex situations where both the set of constraints may change over time and there is flexibility inherent in the definition of the problem. This paper also presents a means by which classical planning can be extended via fuzzy sets to enable flexible goals and preferences to be placed on the use of planning operators. A range of plans can be produced, trading compromises made versus the length of the plan. The flexible planning operators are close in definition to fuzzy constraints. Hence, through a hierarchical decomposition of the planning graph, the work shows how flexible planning reduces to the solution of a set of fuzzy rrDFCSPs.
Rough Feature Selection for Neural Network Based Image Classification.

A rough%2Dfuzzy approach for generating classification rules.
The generation of e ective feature pattern-based classification rules is essential to the development of any intelligent classifier which is readily comprehensible to the user. This paper presents an approach that integrates a potentially powerful fuzzy rule induction algorithm with a rough set-assisted feature reduction method. The integrated rule generation mechanism maintains the underlying semantics of the feature set. Through the proposed integration, the original rule induction algorithm (or any other similar technique that generates descriptive fuzzy rules), which is sensitive to the dimensionality of the dataset, becomes usable on classifying patterns composed of a moderately large number of features. The resulting learned ruleset becomes manageable and may outperform rules learned using more features. This, as demonstrated with successful realistic applications, makes the present approach effective in handling real world problems.
Towards Temporal Linguistic Variables.

Linguistic Hedges on Tradezoidal Fuzzy Sets A Revisit.

Selection of Features in Transparent Fuzzy Modelling.

A Rough Set%2DAided System for Sorting WWW Bookmarks.
Abstract. Most people store ‘bookmarks ’ to web pages. These allow the user to return to a web page later on, without having to remember the exact URL address. People attempt to organise their bookmark databases by filing bookmarks under categories, themselves arranged in a hierarchical fashion. As the maintenance of such large repositories is difficult and time-consuming, a tool that automatically categorises bookmarks is required. This paper investigates how rough set theory can help extract information out of this domain, for use in an experimental automatic bookmark classification system. In particular, work on rough set dependency degrees is applied to reduce the otherwise high dimensionality of the feature patterns used to characterize bookmarks. A comparison is made between this approach to data reduction and a conventional entropy-based approach. 1
On the specification of multiple models for diagnosis of dynamic systems.

Rough Set%2DAided Keyword Reduction for Text Categorization.
Abstract: In this paper, we propose an intrusion detection method that combines rough sets theory and fuzzy c-means for anomaly detection. The first step consists of attribute selection which is based on rough set theory for each of the 5 classes of intrusions in the Defense Advanced Research Projects Agency (DARPA) data is identified. The next phase is clustering by using fuzzy c-means; we are using rough sets for cleaning and to filtering out redundant, spurious information. Fuzzy c-means allow objects to belong to several clusters simultaneously, with different degrees of membership. Our method is an accurate model for handling complex attack patterns in large networks. We used data set from 1999 Knowledge Discovery and Data mining (KDD) intrusion detection contest. The main goal of this paper is to apply this method to increase the efficiency of a given intrusion detection model and to be able to reduce the data set by looking for overlapping categories and also to filter in the desired ones.
FuREAP a Fuzzy%2DRough Estimator of Algae Populations.
The curse of dimensionality is a damning factor for numerous potentially powerful machine learning techniques. Widely approved and otherwise elegant methodologies used for a number of different tasks ranging from classification to function approximation exhibit relatively high computational complexity with respect to dimensionality. This limits severely the applicability of such techniques to real world problems. Rough set theory is a formal methodology that can be employed to reduce the dimensionality of datasets as a preprocessing step to training a learning system on the data. This paper investigates the utility of the Rough Set Attribute Reduction (RSAR) technique to both supervised and unsupervised learning in an effort to probe RSAR’s generality. FuREAP, a Fuzzy-Rough Estimator of Algae Populations, which is an existing integration of RSAR and a fuzzy Rule Induction Algorithm (RIA), is used as an example of a supervised learning system with dimensionality reduction capabilities. A similar framework integrating the Multivariate Adaptive Regression Splines (MARS) approach and RSAR is taken to represent unsupervised learning systems. The paper describes the three techniques in question, discusses how RSAR can be employed with a supervised or an unsupervised system, and uses experimental results to draw conclusions on the relative success of the two integration efforts.
Rough Set%2DAided Keyword Reduction for Text Categorization.
Abstract: In this paper, we propose an intrusion detection method that combines rough sets theory and fuzzy c-means for anomaly detection. The first step consists of attribute selection which is based on rough set theory for each of the 5 classes of intrusions in the Defense Advanced Research Projects Agency (DARPA) data is identified. The next phase is clustering by using fuzzy c-means; we are using rough sets for cleaning and to filtering out redundant, spurious information. Fuzzy c-means allow objects to belong to several clusters simultaneously, with different degrees of membership. Our method is an accurate model for handling complex attack patterns in large networks. We used data set from 1999 Knowledge Discovery and Data mining (KDD) intrusion detection contest. The main goal of this paper is to apply this method to increase the efficiency of a given intrusion detection model and to be able to reduce the data set by looking for overlapping categories and also to filter in the desired ones.

Solution Techniques for Constraint Satisfaction Problems Foundations.


Flexible Graphplan.
 Constraint satisfaction is a fundamental Artificial Intelligence technique for knowledge representation and inference. It has, however, become clear that the original formulation of a static constraint satisfaction problem (CSP) with hard, imperative constraints is insucient to model many real problems. Recent work has addressed these shortcomings in the form of two separate extensions known as dynamic CSP and flexible CSP respectively. Little has yet been done to combine dynamic and exible CSP in order to bring to bear the benefits of both in solving more complex problems. Based on a 
Rough Set%2DBased Dimensionality Reduction for Multivariate Adaptive Regression Splines.

Dynamic Flexible Constraint Satisfaction.
  Existing techniques for solving constraint satisfaction problems (CSPs) are largely concerned with a static set of imperative, inflexible constraints. Recently, work has addressed these shortcomings of classical constraint satisfaction in the form of two separate extensions known as flexible and dynamic CSP. Little, however, has been done to combine these two approaches in order to bring to bear the benefits of both in solving more complex problems. This paper presents a new integrated algorithm, Flexible Local Changes, for dynamic flexible problems. It is further shown how the use of flexible consistency-enforcing techniques can improve solution re-use and hence the efficiency of the core algorithm. Empirical evidence is provided to support the success of the present approach. 
A Rough Set%2DBased Approach to Text Classification.

Combining rough sets and data%2Ddriven fuzzy learning for generation of classification rules.

Selecting tools and techniques for model%2Dbased diagnosis.

Diagnosing continuous systems with qualitative dynamic models.

A Preliminary Specification Methodology for Model%2Dbased Diagnosis.

Prioritising Behaviours in Qualitative Simulation.

On extending the quantity space in qualitative reasoning.

